Enumeration under group action: Unsolved graphical enumeration problems, IV

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Unsolved Problems in Map Enumeration

For many years, people have considered various problems in the enumeration of graphs, beginning with the enumeration of trees. Extensive work on the enumeration of maps did not begin until Tutte's work in the 1960's; however, one map enumeration problem| the determination of the number of combinatorially inequivalent 3-dimensional convex polytopes|is over a century old. Traditionally an map has...

متن کامل

An Enumeration of Graphical Designs

Let Ψ(t, k) denote the set of pairs (v, λ) for which there exists a graphical t-(v, k, λ) design. Most results on graphical designs have gone to show the finiteness of Ψ(t, k) when t and k satisfy certain conditions. The exact determination of Ψ(t, k) for specified t and k is a hard problem and only Ψ(2, 3), Ψ(2, 4), Ψ(3, 4), Ψ(4, 5), and Ψ(5, 6) have been determined. In this paper, we determin...

متن کامل

An application of graphical enumeration to PA*

For α less than ε0 let Nα be the number of occurrences of ω in the Cantor normal form of α. Further let |n| denote the binary length of a natural number n, let |n|h denote the h-times iterated binary length of n and let inv(n) be the least h such that |n|h ≤ 2. We show that for any natural number h first order Peano arithmetic, PA, does not prove the following sentence: For all K there exists a...

متن کامل

Tree Orbits under Permutation Group Action: Algorithm, Enumeration and Application to Viral Assembly

This paper uses combinatorics and group theory to answer questions about the assembly of icosahedral viral shells. Although the geometric structure of the capsid (shell) is fairly well understood in terms of its constituent subunits, the assembly process is not. For the purpose of this paper, the capsid is modeled by a polyhedron whose facets represent the monomers. The assembly process is mode...

متن کامل

Enumeration of viral capsid assembly pathways: tree orbits under permutation group action.

This paper uses combinatorics and group theory to answer questions about the assembly of icosahedral viral shells. Although the geometric structure of the capsid (shell) is fairly well understood in terms of its constituent subunits, the assembly process is not. For the purpose of this paper, the capsid is modeled by a polyhedron whose facets represent the monomers. The assembly process is mode...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory

سال: 1970

ISSN: 0021-9800

DOI: 10.1016/s0021-9800(70)80003-5